SoleX: A domain-independent scheme for constraint solver extension
Identifieur interne : 00B321 ( Main/Exploration ); précédent : 00B320; suivant : 00B322SoleX: A domain-independent scheme for constraint solver extension
Auteurs : Eric Monfroy [Pays-Bas] ; Christophe Ringeissen [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle, Robotique.
English descriptors
- KwdEn :
Abstract
Abstract: In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.
Url:
DOI: 10.1007/BFb0055915
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002525
- to stream Istex, to step Curation: 002494
- to stream Istex, to step Checkpoint: 002553
- to stream Main, to step Merge: 00BA43
- to stream PascalFrancis, to step Corpus: 000B56
- to stream PascalFrancis, to step Curation: 000D14
- to stream PascalFrancis, to step Checkpoint: 000B30
- to stream Main, to step Merge: 00BB52
- to stream Main, to step Curation: 00B321
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">SoleX: A domain-independent scheme for constraint solver extension</title><author><name sortKey="Monfroy, Eric" sort="Monfroy, Eric" uniqKey="Monfroy E" first="Eric" last="Monfroy">Eric Monfroy</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9E7D37410A92A9A7896CAAE840836A572CF7E966</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0055915</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-HT28M0M4-L/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002525</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002525</idno><idno type="wicri:Area/Istex/Curation">002494</idno><idno type="wicri:Area/Istex/Checkpoint">002553</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002553</idno><idno type="wicri:doubleKey">0302-9743:1998:Monfroy E:solex:a:domain</idno><idno type="wicri:Area/Main/Merge">00BA43</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:99-0033983</idno><idno type="wicri:Area/PascalFrancis/Corpus">000B56</idno><idno type="wicri:Area/PascalFrancis/Curation">000D14</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000B30</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B30</idno><idno type="wicri:doubleKey">0302-9743:1998:Monfroy E:solex:a:domain</idno><idno type="wicri:Area/Main/Merge">00BB52</idno><idno type="wicri:Area/Main/Curation">00B321</idno><idno type="wicri:Area/Main/Exploration">00B321</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">SoleX: A domain-independent scheme for constraint solver extension</title><author><name sortKey="Monfroy, Eric" sort="Monfroy, Eric" uniqKey="Monfroy E" first="Eric" last="Monfroy">Eric Monfroy</name><affiliation wicri:level="1"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>CWI, P.O. Box 94079, NL-1090, GB Amsterdam</wicri:regionArea><wicri:noRegion>GB Amsterdam</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Pays-Bas</country></affiliation></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101, F-54602, Villers-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term><term>Automatic proving</term><term>Constraint logic programming</term><term>Robotics</term><term>Theorem proving</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Démonstration automatique</term><term>Démonstration théorème</term><term>Intelligence artificielle</term><term>Programmation logique avec contrainte</term><term>Robotique</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term><term>Robotique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called SoleX, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.</div></front></TEI><affiliations><list><country><li>France</li><li>Pays-Bas</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Villers-lès-Nancy</li></settlement></list><tree><country name="Pays-Bas"><noRegion><name sortKey="Monfroy, Eric" sort="Monfroy, Eric" uniqKey="Monfroy E" first="Eric" last="Monfroy">Eric Monfroy</name></noRegion><name sortKey="Monfroy, Eric" sort="Monfroy, Eric" uniqKey="Monfroy E" first="Eric" last="Monfroy">Eric Monfroy</name></country><country name="France"><region name="Grand Est"><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></region><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B321 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B321 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:9E7D37410A92A9A7896CAAE840836A572CF7E966
|texte= SoleX: A domain-independent scheme for constraint solver extension
}}
| This area was generated with Dilib version V0.6.33. |  |